A Generalized Markov Sampler
نویسندگان
چکیده
منابع مشابه
Umacs: A Universal Markov Chain Sampler
Umacs (Universal Markov chain sampler) is an R software package that facilitates the construction of the Gibbs sampler and Metropolis algorithm for Bayesian inference. Umacs is a practical tool to write samplers in R. This is sometimes necessary for large problems that cannot be fit using programs like BUGS. The user supplies the data, parameter names, updating functions, and a procedure for ge...
متن کاملAnalysis of a Nonreversible Markov Chain Sampler
We analyze the convergence to stationarity of a simple nonreversible Markov chain that serves as a model for several nonreversible Markov chain sampling methods that are used in practice. Our theoretical and numerical results show that nonreversibility can indeed lead to improvements over the diffusive behavior of simple Markov chain sampling schemes. The analysis uses both probabilistic techni...
متن کاملConvergence of slice sampler Markov
In this paper, we analyse theoretical properties of the slice sampler. We nd that the algorithm has extremely robust geometric ergodicity properties. For the case of just one auxiliary variable, we demonstrate that the algorithm is stochasti-cally monotone, and deduce analytic bounds on the total variation distance from stationarity of the method using Foster-Lyapunov drift condition methodology.
متن کاملThe Generalized Gibbs Sampler and the Neighborhood Sampler
The Generalized Gibbs Sampler (GGS) is a recently proposed Markov chain Monte Carlo (MCMC) technique that is particularly useful for sampling from distributions defined on spaces in which the dimension varies from point to point or in which points are not easily defined in terms of co-ordinates. Such spaces arise in problems involving model selection and model averaging and in a number of inter...
متن کاملConvergence of slice sampler Markov chains
This paper considers the use of slice samplers to sample from a complicated d-dimensional probability distribution. Slice samplers are a form of auxiliary variable technique, which introduces auxiliary random variables Y1, . . ., Yk to facilitate the design of an improved Markov chain Monte Carlo (MCMC) sampling algorithm. The idea of using auxiliary variables for improving MCMC algorithms was ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Methodology and Computing in Applied Probability
سال: 2004
ISSN: 1387-5841
DOI: 10.1023/b:mcap.0000012414.14405.15